2 SOME PRINCIPLES TRUE IN COHEN MODELS 22 Some Prin
ثبت نشده
چکیده
منابع مشابه
ar X iv : m at h / 96 05 21 1 v 1 [ m at h . L O ] 1 4 M ay 1 99 6 COMBINATORIAL PRINCIPLES FROM ADDING COHEN REALS
We first formulate several " combinatorial principles " concerning κ × ω matrices of subsets of ω and prove that they are valid in the generic extension obtained by adding any number of Cohen reals to any ground model V , provided that the parameter κ is an ω-inaccessible regular cardinal in V. Then in section 4 we present a large number of applications of these principles, mainly to topology. ...
متن کاملAmalgamated duplication of some special rings along an ideal
Let be a commutative Noetherian ring and let I be a proper ideal of . D’Anna and Fontana in [6] introduced a new construction of ring, named amalgamated duplication of along I. In this paper by considering the ring homomorphism , it is shown that if , then , also it is proved that if , then there exists such that . Using this result it is shown that if is generically Cohen-Macaulay (resp. gen...
متن کاملTesting Several Rival Models Using the Extension of Vuong\'s Test and Quasi Clustering
The two main goals in model selection are firstly introducing an approach to test homogeneity of several rival models and secondly selecting a set of reasonable models or estimating the best rival model to the true one. In this paper we extend Vuong's method for several models to cluster them. Based on the working paper of Katayama $(2008)$, we propose an approach to test whether rival models h...
متن کاملSome Conditions for Characterizing Minimum Face in Non-Radial DEA Models with Undesirable Outputs
The problem of utilizing undesirable (bad) outputs in DEA models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. The Kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. Also, there are some specific features of non-radial data envelopment analysis (DEA...
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کامل